Primitive recursive selection functions for existential assertions over abstract algebras
نویسندگان
چکیده
منابع مشابه
Primitive recursive selection functions for existential assertions over abstract algebras
We generalize to abstract many-sorted algebras the classical proof-theoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃yP (x, y) (where P is Σ01), provable in Peano arithmetic withΣ 1 induction, has a primitive recursive selection function. This involves a corresponding generalization to such algebras of the notion of primitive recursiveness . The main difficulty encountere...
متن کاملSome Hierarchies of Primitive Recursive Functions on Term Algebras
We generalize the Grzegorczyk hierarchy fE n g n0 on natural numbers Grz] and Weih-rauch's Grzegorczyk hierarchy fE k n g n0 on words over an alphabet of size k 1 Wei, HIRW] to Grzegorczyk hierarchies on arbitrary term algebras. By a term algebra T we mean the set of terms generated by a set of nitely many function symbols with at least one of arity 0 and 1. As there is a canonical notion of (s...
متن کاملPrimitive Recursive Functions
1. Definition of recursive functions. In this paper, we shall consider certain reductions in the recursion scheme for defining primitive recursive functions. Hereafter, we shall refer to such functions simply as recursive functions. In §1, we define what is meant by a recursive function, and also define some recursive functions which will be used. The statement of the principal results of the p...
متن کاملExtended Primitive Recursive Functions
— In this paper we extend the notion of primitive recursive function to the case in which the domain is N* and the range is a subset oj N*. We give a rigorvus characterization oj tins class oj functions and show différences icith the classical primitive recursive functions. Résumé. — Dans cette note nous étendons la notion de f onction primitive recursive à tous les cas dans lesquels le domaine...
متن کاملUnary Primitive Recursive Functions
In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic and Algebraic Programming
سال: 2008
ISSN: 1567-8326
DOI: 10.1016/j.jlap.2008.02.002